The Multi Supply Function Resource Abstraction for Multiprocessors: the Global EDF case
نویسندگان
چکیده
Abstractions are powerful models that allow to isolate the applications as well as to port an existing applications onto new platforms. At the same time, the multiprocessor will become the dominant computing device in the near future. The paper proposes a technique to abstract to computing power of a parallel machine. We compare with the existing abstractions and we develop the global EDF schedulability analysis on top of the proposed abstraction.ions are powerful models that allow to isolate the applications as well as to port an existing applications onto new platforms. At the same time, the multiprocessor will become the dominant computing device in the near future. The paper proposes a technique to abstract to computing power of a parallel machine. We compare with the existing abstractions and we develop the global EDF schedulability analysis on top of the proposed abstraction.
منابع مشابه
The Parallel Supply Function Abstraction for a Virtual Multiprocessor
A new abstraction — the Parallel Supply Function (PSF) — is proposed for representing the computing capabilities offered by virtual platforms implemented atop identical multiprocessors. It is shown that this abstraction is strictly more powerful than previously-proposed ones, from the perspective of more accurately representing the inherent parallelism of the provided computing capabilities. Su...
متن کاملRobustness results concerning EDF scheduling upon uniform multiprocessors
Each processor in a uniform multiprocessor machine is characterized by a speed or computing capacity, with the interpretation that a job executing on a processor with speed s for t time units completes ðs tÞ units of execution. The earliestdeadline-first (EDF) scheduling of hard-real-time systems upon uniform multiprocessor machines is considered. It is known that online algorithms tend to perf...
متن کاملTowards Compositional Hierarchical Scheduling Frameworks on Uniform Multiprocessors
In this report, we approach the problem of defining and analysing compositional hierarchical scheduling frameworks (HSF) upon uniform multiprocessor platforms. For this we propose the uniform multiprocessor periodic resource (UMPR) model for a component interface. We extend previous results (for dedicated uniform multiprocessors, and for compositional HSFs on identical multiprocessors), providi...
متن کاملA Comparison of Global and Partitioned EDF Schedulability Tests for Multiprocessors TR-051101
This paper compares the performance of several variations on EDF-based global and partitioned multiprocessor scheduling algorithms, together with their associated feasibility tests, on a variety of pseudo-randomly chosen sets of sporadic tasks. A new hybrid EDF-based scheme is shown to perform better than previously studied priority-based global scheduling schemes, though not as well as EDF-bas...
متن کاملAn Efficient Genetic Agorithm for Solving the Multi-Mode Resource-Constrained Project Scheduling Problem Based on Random Key Representation
In this paper, a new genetic algorithm (GA) is presented for solving the multi-mode resource-constrained project scheduling problem (MRCPSP) with minimization of project makespan as the objective subject to resource and precedence constraints. A random key and the related mode list (ML) representation scheme are used as encoding schemes and the multi-mode serial schedule generation scheme (MSSG...
متن کامل